Weighted distances between preferences
نویسندگان
چکیده
منابع مشابه
Weighted Distances for Fuzzy Clustering
The distance measure is an important criterion in any clustering algorithm. This paper shows how fuzzy clustering results can be improved by introducing a weighting factor in the inter-objects distance measures. New weighted versions of four well-known distance measures are considered. These distances are tested, using the fuzzy c-means algorithm, on three datasets. Experimental results show th...
متن کاملRapid execution of weighted edit distances
The comparison of large numbers of strings plays a central role in ontology matching, record linkage and link discovery. While several standard string distance and similarity measures have been developed with these explicit goals in mind, similarities and distances learned out of the data have been shown to often perform better with respect to the F-measure that they can achieve. Still, the pra...
متن کاملQuasi-Distances and Weighted Finite Automata
We show that the neighbourhood of a regular language L with respect to an additive quasi-distance can be recognized by an additive weighted finite automaton (WFA). The size of the WFA is the same as the size of an NFA (nondeterministic finite automaton) for L and the construction gives an upper bound for the state complexity of a neighbourhood of a regular language with respect to a quasi-dista...
متن کاملAdditive Distances and Quasi-Distances Between Words
We study additive distances and quasi-distances between words. We show that every additive distance is finite. We then prove that every additive quasi-distance is regularity-preserving, that is, the neighborhood of any radius of a regular language with respect to an additive quasi-distance is regular. Finally, similar results will be proven for context-free, computable and computably enumerable...
متن کاملCapacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances
Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Economics
سال: 2014
ISSN: 0304-4068
DOI: 10.1016/j.jmateco.2014.01.002